________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:31:00
Input Data from:  dataset131.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0673333333333333
Average f[i]   :3550
Average g[i,j] :1890,47619047619
Total demand   :16750
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 23
> Selected Move:	3520	1	-1	6	5500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0    >new incumb.: 3520


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 30
> Selected Move:	4340	1	-1	3	10000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0    >new incumb.: 4340


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	5350	1	-1	9	15500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1    >new incumb.: 5350


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 31
> Selected Move:	6090	1	-1	8	19500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  1    >new incumb.: 6090


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 26
> Selected Move:	6020	3	3	5	20000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 23
> Selected Move:	5910	3	9	3	19000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 27
> Selected Move:	5940	3	5	4	19000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 27
> Selected Move:	5880	3	3	9	20000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 23
> Selected Move:	5715	3	8	3	20500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 22
> Selected Move:	5700	3	9	5	20000


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 23
> Selected Move:	5700	3	3	8	19500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 27
> Selected Move:	5270	3	6	3	18500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 26
> Selected Move:	5470	3	5	9	19000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 25
> Selected Move:	5420	3	4	5	19000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 24
> Selected Move:	5680	3	8	6	20500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 22
> Selected Move:	5468	3	5	7	21500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 19
> Selected Move:	5490	3	9	8	20000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 29
> Selected Move:	5465	3	8	5	21000


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 24
> Selected Move:	5360	3	5	4	21000


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 27
> Selected Move:	5190	2	4	-1	16000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 30
> Selected Move:	5330	3	7	8	14000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 27
> Selected Move:	5270	3	3	9	15000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 24
> Selected Move:	5190	3	8	7	17000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 24
> Selected Move:	5110	1	-1	5	22000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 24 #######################


> Neighbours evaluated; 20
> Selected Move:	5280	3	7	4	21000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 25 #######################


> Neighbours evaluated; 19
> Selected Move:	5360	3	6	3	20000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 26 #######################


> Neighbours evaluated; 22
> Selected Move:	5210	3	3	8	19500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 27 #######################


> Neighbours evaluated; 25
> Selected Move:	4935	3	1	6	21000


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 28 #######################


> Neighbours evaluated; 19
> Selected Move:	5410	3	9	3	20000


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 29 #######################


> Neighbours evaluated; 17
> Selected Move:	5408	3	5	9	20500


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 30 #######################


> Neighbours evaluated; 18
> Selected Move:	5360	3	4	5	20500


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 31 #######################


> Neighbours evaluated; 22
> Selected Move:	5155	4	6	5	21000


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 32 #######################


> Neighbours evaluated; 22
> Selected Move:	5205	3	9	4	20500


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 33 #######################


> Neighbours evaluated; 17
> Selected Move:	5195	3	5	9	21000


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 34 #######################


> Neighbours evaluated; 20
> Selected Move:	5160	3	6	5	20500


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 35 #######################


> Neighbours evaluated; 19
> Selected Move:	5158	4	9	5	20500


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 36 #######################


> Neighbours evaluated; 23
> Selected Move:	4811	4	5	3	21300


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 37 #######################


> Neighbours evaluated; 20
> Selected Move:	4845	3	9	6	21300


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 38 #######################


> Neighbours evaluated; 18
> Selected Move:	4850	2	5	-1	16300


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 39 #######################


> Neighbours evaluated; 25
> Selected Move:	5000	3	4	9	16800


> New Y[]: 
	
	 2  0  4  3  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 40 #######################


> Neighbours evaluated; 25
> Selected Move:	5060	3	8	7	18800


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 41 #######################


> Neighbours evaluated; 17
> Selected Move:	5060	4	3	6	17500


> New Y[]: 
	
	 2  0  4  1  0  0  3  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 42 #######################


> Neighbours evaluated; 21
> Selected Move:	5060	4	6	7	17300


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 43 #######################


> Neighbours evaluated; 20
> Selected Move:	5060	4	7	9	18000


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 44 #######################


> Neighbours evaluated; 18
> Selected Move:	5000	3	7	8	16000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 45 #######################


> Neighbours evaluated; 23
> Selected Move:	5105	1	-1	5	21000


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 46 #######################


> Neighbours evaluated; 20
> Selected Move:	4890	2	8	-1	17000


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 47 #######################


> Neighbours evaluated; 21
> Selected Move:	5090	3	9	1	15000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 48 #######################


> Neighbours evaluated; 26
> Selected Move:	5090	3	3	7	16500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,435

## ITERATION 49 #######################


> Neighbours evaluated; 29
> Selected Move:	5203	1	-1	8	20500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 50 #######################


> Neighbours evaluated; 29
> Selected Move:	5090	2	7	-1	14500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 51 #######################


> Neighbours evaluated; 28
> Selected Move:	5090	3	8	9	16000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 52 #######################


> Neighbours evaluated; 26
> Selected Move:	4950	3	5	4	16000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 53 #######################


> Neighbours evaluated; 27
> Selected Move:	4970	1	-1	7	22000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,41

## ITERATION 54 #######################


> Neighbours evaluated; 18
> Selected Move:	5120	3	6	3	21000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 55 #######################


> Neighbours evaluated; 25
> Selected Move:	5075	3	4	5	21000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 56 #######################


> Neighbours evaluated; 21
> Selected Move:	5020	3	5	8	20000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 57 #######################


> Neighbours evaluated; 28
> Selected Move:	5035	3	3	6	21000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 58 #######################


> Neighbours evaluated; 22
> Selected Move:	5080	3	9	4	20500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 59 #######################


> Neighbours evaluated; 27
> Selected Move:	5093	3	8	5	21500


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 60 #######################


> Neighbours evaluated; 24
> Selected Move:	4950	2	5	-1	16500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 61 #######################


> Neighbours evaluated; 28
> Selected Move:	4950	3	7	3	15000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 62 #######################


> Neighbours evaluated; 25
> Selected Move:	4950	3	3	8	14500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 63 #######################


> Neighbours evaluated; 27
> Selected Move:	4880	3	8	5	15500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 64 #######################


> Neighbours evaluated; 24
> Selected Move:	4680	3	1	9	17500


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 65 #######################


> Neighbours evaluated; 23
> Selected Move:	4940	3	5	3	17000


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 66 #######################


> Neighbours evaluated; 19
> Selected Move:	4940	4	9	3	17800


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 67 #######################


> Neighbours evaluated; 19
> Selected Move:	4940	4	3	4	17800


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 68 #######################


> Neighbours evaluated; 20
> Selected Move:	5000	3	4	8	17000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 69 #######################


> Neighbours evaluated; 22
> Selected Move:	5000	4	8	6	15500


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 70 #######################


> Neighbours evaluated; 25
> Selected Move:	4940	3	8	4	16500


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 71 #######################


> Neighbours evaluated; 20
> Selected Move:	4908	1	-1	5	21500


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 72 #######################


> Neighbours evaluated; 17
> Selected Move:	4890	2	4	-1	16500


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 73 #######################


> Neighbours evaluated; 20
> Selected Move:	4890	4	6	3	17800


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 74 #######################


> Neighbours evaluated; 18
> Selected Move:	4890	4	3	5	17000


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 75 #######################


> Neighbours evaluated; 18
> Selected Move:	4820	3	6	7	17500


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 76 #######################


> Neighbours evaluated; 24
> Selected Move:	4920	3	5	1	16000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 77 #######################


> Neighbours evaluated; 25
> Selected Move:	5060	3	2	6	17700


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 78 #######################


> Neighbours evaluated; 23
> Selected Move:	5060	4	6	3	18900


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 79 #######################


> Neighbours evaluated; 18
> Selected Move:	5060	4	3	7	17500


> New Y[]: 
	
	 2  3  0  1  0  0  1  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 80 #######################


> Neighbours evaluated; 21
> Selected Move:	5060	4	7	9	18000


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 81 #######################


> Neighbours evaluated; 21
> Selected Move:	5000	3	7	8	16000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 82 #######################


> Neighbours evaluated; 25
> Selected Move:	5270	1	-1	4	21000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 83 #######################


> Neighbours evaluated; 19
> Selected Move:	5376	4	9	6	20700


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 84 #######################


> Neighbours evaluated; 20
> Selected Move:	5344	3	9	5	20200


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 85 #######################


> Neighbours evaluated; 18
> Selected Move:	5333	3	4	9	20700


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 86 #######################


> Neighbours evaluated; 24
> Selected Move:	5240	4	6	9	21000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 87 #######################


> Neighbours evaluated; 22
> Selected Move:	5228	3	6	4	20500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 88 #######################


> Neighbours evaluated; 24
> Selected Move:	5093	4	9	5	20900


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 89 #######################


> Neighbours evaluated; 22
> Selected Move:	5109	3	9	6	20900


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 90 #######################


> Neighbours evaluated; 18
> Selected Move:	5084	3	4	9	21400


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 91 #######################


> Neighbours evaluated; 23
> Selected Move:	4920	3	5	4	22000


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 92 #######################


> Neighbours evaluated; 20
> Selected Move:	4945	4	4	3	21900


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 93 #######################


> Neighbours evaluated; 19
> Selected Move:	5000	2	4	-1	16900


> New Y[]: 
	
	 2  3  0  4  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 94 #######################


> Neighbours evaluated; 23
> Selected Move:	5000	4	3	6	15700


> New Y[]: 
	
	 2  3  0  1  0  0  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 95 #######################


> Neighbours evaluated; 23
> Selected Move:	5000	4	6	8	17000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 96 #######################


> Neighbours evaluated; 25
> Selected Move:	4940	3	8	4	18000


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 97 #######################


> Neighbours evaluated; 19
> Selected Move:	4940	4	4	3	17900


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 98 #######################


> Neighbours evaluated; 19
> Selected Move:	4940	4	3	6	16700


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 99 #######################


> Neighbours evaluated; 21
> Selected Move:	4940	4	6	9	17000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 100 #######################


> Neighbours evaluated; 19
> Selected Move:	4890	3	4	5	17000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 101 #######################


> Neighbours evaluated; 21
> Selected Move:	4890	4	9	3	17900


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 102 #######################


> Neighbours evaluated; 19
> Selected Move:	4890	4	3	5	17400


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 103 #######################


> Neighbours evaluated; 19
> Selected Move:	4890	4	5	6	16700


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 104 #######################


> Neighbours evaluated; 19
> Selected Move:	4905	1	-1	4	21700


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 105 #######################


> Neighbours evaluated; 17
> Selected Move:	4936	3	3	8	21200


> New Y[]: 
	
	 2  3  0  0  1  1  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 106 #######################


> Neighbours evaluated; 23
> Selected Move:	4914	3	6	3	21400


> New Y[]: 
	
	 2  3  0  4  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 107 #######################


> Neighbours evaluated; 20
> Selected Move:	4941	3	9	6	21400


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 108 #######################


> Neighbours evaluated; 18
> Selected Move:	4933	3	4	9	21900


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 109 #######################


> Neighbours evaluated; 16
> Selected Move:	4890	4	3	8	22000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 110 #######################


> Neighbours evaluated; 18
> Selected Move:	4930	3	5	4	22000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 111 #######################


> Neighbours evaluated; 19
> Selected Move:	4893	3	9	5	21500


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  4  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 112 #######################


> Neighbours evaluated; 18
> Selected Move:	4885	4	8	4	21500


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 113 #######################


> Neighbours evaluated; 17
> Selected Move:	4858	3	6	9	21500


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 114 #######################


> Neighbours evaluated; 17
> Selected Move:	4850	4	4	8	21500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 115 #######################


> Neighbours evaluated; 20
> Selected Move:	4830	2	5	-1	16500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 116 #######################


> Neighbours evaluated; 23
> Selected Move:	4890	3	8	7	17000


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 117 #######################


> Neighbours evaluated; 23
> Selected Move:	4890	4	7	3	18400


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 118 #######################


> Neighbours evaluated; 20
> Selected Move:	4890	4	3	4	18500


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 119 #######################


> Neighbours evaluated; 18
> Selected Move:	4890	4	4	9	17500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 120 #######################


> Neighbours evaluated; 22
> Selected Move:	4850	3	0	6	19500


> New Y[]: 
	
	 0  3  0  1  1  0  2  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 121 #######################


> Neighbours evaluated; 20
> Selected Move:	4850	4	6	4	19900


> New Y[]: 
	
	 0  3  0  1  2  0  1  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 122 #######################


> Neighbours evaluated; 19
> Selected Move:	4850	4	4	7	19000


> New Y[]: 
	
	 0  3  0  1  1  0  1  2  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 123 #######################


> Neighbours evaluated; 18
> Selected Move:	4850	4	7	9	18600


> New Y[]: 
	
	 0  3  0  1  1  0  1  4  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 124 #######################


> Neighbours evaluated; 19
> Selected Move:	4850	4	7	3	20000


> New Y[]: 
	
	 0  3  0  4  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 125 #######################


> Neighbours evaluated; 19
> Selected Move:	4850	4	3	6	18800


> New Y[]: 
	
	 0  3  0  1  1  0  4  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 126 #######################


> Neighbours evaluated; 16
> Selected Move:	4850	4	9	3	20000


> New Y[]: 
	
	 0  3  0  2  1  0  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 127 #######################


> Neighbours evaluated; 19
> Selected Move:	4850	4	3	4	19600


> New Y[]: 
	
	 0  3  0  1  2  0  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 128 #######################


> Neighbours evaluated; 16
> Selected Move:	4850	4	4	7	18700


> New Y[]: 
	
	 0  3  0  1  1  0  4  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 129 #######################


> Neighbours evaluated; 15
> Selected Move:	4850	4	6	3	19900


> New Y[]: 
	
	 0  3  0  4  1  0  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 130 #######################


> Neighbours evaluated; 17
> Selected Move:	4850	4	3	4	20000


> New Y[]: 
	
	 0  3  0  1  4  0  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 131 #######################


> Neighbours evaluated; 17
> Selected Move:	4920	3	4	2	17500


> New Y[]: 
	
	 0  3  4  1  0  0  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 132 #######################


> Neighbours evaluated; 26
> Selected Move:	4920	4	7	3	18800


> New Y[]: 
	
	 0  3  4  2  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 133 #######################


> Neighbours evaluated; 23
> Selected Move:	4920	4	3	6	18000


> New Y[]: 
	
	 0  3  4  1  0  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 134 #######################


> Neighbours evaluated; 25
> Selected Move:	4920	4	6	9	17600


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 135 #######################


> Neighbours evaluated; 24
> Selected Move:	4860	3	7	8	15600


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 136 #######################


> Neighbours evaluated; 25
> Selected Move:	5284	1	-1	4	20600


> New Y[]: 
	
	 0  3  4  1  1  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 137 #######################


> Neighbours evaluated; 20
> Selected Move:	5237	3	4	5	20600


> New Y[]: 
	
	 0  3  4  1  0  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 138 #######################


> Neighbours evaluated; 21
> Selected Move:	5180	3	6	4	20100


> New Y[]: 
	
	 0  3  4  1  1  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 139 #######################


> Neighbours evaluated; 16
> Selected Move:	5123	3	9	6	20500


> New Y[]: 
	
	 0  3  4  1  1  1  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 140 #######################


> Neighbours evaluated; 23
> Selected Move:	5180	3	5	9	21000


> New Y[]: 
	
	 0  3  4  1  1  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 141 #######################


> Neighbours evaluated; 20
> Selected Move:	5125	3	4	5	21000


> New Y[]: 
	
	 0  3  4  1  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 142 #######################


> Neighbours evaluated; 24
> Selected Move:	4940	3	6	4	20900


> New Y[]: 
	
	 0  3  4  1  2  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 143 #######################


> Neighbours evaluated; 16
> Selected Move:	5043	3	5	6	21400


> New Y[]: 
	
	 0  3  4  1  2  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 144 #######################


> Neighbours evaluated; 23
> Selected Move:	4991	3	9	5	20900


> New Y[]: 
	
	 0  3  4  1  2  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 145 #######################


> Neighbours evaluated; 23
> Selected Move:	4861	4	4	3	21300


> New Y[]: 
	
	 0  3  4  2  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 146 #######################


> Neighbours evaluated; 23
> Selected Move:	4894	3	5	9	21800


> New Y[]: 
	
	 0  3  4  2  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 147 #######################


> Neighbours evaluated; 19
> Selected Move:	4860	2	4	-1	16800


> New Y[]: 
	
	 0  3  4  2  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 148 #######################


> Neighbours evaluated; 23
> Selected Move:	4860	4	3	6	16000


> New Y[]: 
	
	 0  3  4  1  0  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 149 #######################


> Neighbours evaluated; 23
> Selected Move:	4860	4	6	8	17600


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 150 #######################


> Neighbours evaluated; 22
> Selected Move:	4800	3	8	4	17400


> New Y[]: 
	
	 0  3  4  1  2  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 151 #######################


> Neighbours evaluated; 23
> Selected Move:	4850	3	1	7	19200


> New Y[]: 
	
	 0  0  4  1  2  0  1  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 152 #######################


> Neighbours evaluated; 19
> Selected Move:	4850	4	4	3	19600


> New Y[]: 
	
	 0  0  4  2  1  0  1  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 153 #######################


> Neighbours evaluated; 20
> Selected Move:	4850	4	3	6	18800


> New Y[]: 
	
	 0  0  4  1  1  0  2  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 154 #######################


> Neighbours evaluated; 19
> Selected Move:	4870	3	6	0	16800


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 155 #######################


> Neighbours evaluated; 23
> Selected Move:	4900	1	-1	6	22300


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 156 #######################


> Neighbours evaluated; 17
> Selected Move:	4950	3	7	8	22000


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 157 #######################


> Neighbours evaluated; 20
> Selected Move:	5025	4	8	3	21800


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 158 #######################


> Neighbours evaluated; 14
> Selected Move:	5034	4	3	4	21800


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 159 #######################


> Neighbours evaluated; 19
> Selected Move:	5001	3	9	5	21300


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 160 #######################


> Neighbours evaluated; 18
> Selected Move:	4954	3	6	9	21300


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 161 #######################


> Neighbours evaluated; 20
> Selected Move:	4883	4	4	8	21500


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 162 #######################


> Neighbours evaluated; 20
> Selected Move:	4915	3	9	6	21500


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 163 #######################


> Neighbours evaluated; 19
> Selected Move:	4890	3	4	9	22000


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 164 #######################


> Neighbours evaluated; 16
> Selected Move:	4948	4	8	3	21800


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 165 #######################


> Neighbours evaluated; 19
> Selected Move:	4800	2	9	-1	16300


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 166 #######################


> Neighbours evaluated; 20
> Selected Move:	4800	4	3	5	15500


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 167 #######################


> Neighbours evaluated; 20
> Selected Move:	4850	3	5	4	16300


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 168 #######################


> Neighbours evaluated; 19
> Selected Move:	4850	4	4	6	15000


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 169 #######################


> Neighbours evaluated; 20
> Selected Move:	4850	4	6	8	16500


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 170 #######################


> Neighbours evaluated; 19
> Selected Move:	4810	3	6	9	16500


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 171 #######################


> Neighbours evaluated; 21
> Selected Move:	4810	4	8	3	16300


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 172 #######################


> Neighbours evaluated; 21
> Selected Move:	4870	3	8	7	18300


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 173 #######################


> Neighbours evaluated; 20
> Selected Move:	4870	4	3	4	18300


> New Y[]: 
	
	 2  0  4  1  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 174 #######################


> Neighbours evaluated; 18
> Selected Move:	4870	4	4	9	17500


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 175 #######################


> Neighbours evaluated; 22
> Selected Move:	4850	3	0	6	19500


> New Y[]: 
	
	 0  0  4  1  1  0  2  1  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 176 #######################


> Neighbours evaluated; 19
> Selected Move:	4850	4	6	4	19900


> New Y[]: 
	
	 0  0  4  1  2  0  1  1  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 177 #######################


> Neighbours evaluated; 18
> Selected Move:	4850	4	4	7	19000


> New Y[]: 
	
	 0  0  4  1  1  0  1  2  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 178 #######################


> Neighbours evaluated; 18
> Selected Move:	4850	4	7	9	18400


> New Y[]: 
	
	 0  0  4  1  1  0  1  3  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 179 #######################


> Neighbours evaluated; 17
> Selected Move:	4850	4	7	3	19900


> New Y[]: 
	
	 0  0  4  3  1  0  1  1  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 180 #######################


> Neighbours evaluated; 19
> Selected Move:	4850	4	3	4	19900


> New Y[]: 
	
	 0  0  4  1  3  0  1  1  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 181 #######################


> Neighbours evaluated; 15
> Selected Move:	4850	4	4	6	18600


> New Y[]: 
	
	 0  0  4  1  1  0  3  1  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 182 #######################


> Neighbours evaluated; 15
> Selected Move:	4850	4	9	3	19800


> New Y[]: 
	
	 0  0  4  2  1  0  3  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 183 #######################


> Neighbours evaluated; 18
> Selected Move:	4850	4	3	4	19400


> New Y[]: 
	
	 0  0  4  1  2  0  3  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 184 #######################


> Neighbours evaluated; 15
> Selected Move:	4850	4	4	7	18500


> New Y[]: 
	
	 0  0  4  1  1  0  3  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 185 #######################


> Neighbours evaluated; 15
> Selected Move:	4850	4	6	3	19800


> New Y[]: 
	
	 0  0  4  3  1  0  1  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 186 #######################


> Neighbours evaluated; 15
> Selected Move:	4850	4	3	4	19800


> New Y[]: 
	
	 0  0  4  1  3  0  1  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 187 #######################


> Neighbours evaluated; 13
> Selected Move:	4800	3	4	5	19000


> New Y[]: 
	
	 0  0  4  1  0  3  1  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 188 #######################


> Neighbours evaluated; 18
> Selected Move:	4800	4	5	3	19800


> New Y[]: 
	
	 0  0  4  3  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 189 #######################


> Neighbours evaluated; 18
> Selected Move:	4800	4	3	6	18500


> New Y[]: 
	
	 0  0  4  1  0  1  3  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 190 #######################


> Neighbours evaluated; 18
> Selected Move:	4800	4	6	7	18800


> New Y[]: 
	
	 0  0  4  1  0  1  2  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 191 #######################


> Neighbours evaluated; 20
> Selected Move:	4820	3	6	0	16800


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 192 #######################


> Neighbours evaluated; 21
> Selected Move:	5022	1	-1	6	22300


> New Y[]: 
	
	 2  0  4  1  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 193 #######################


> Neighbours evaluated; 18
> Selected Move:	4983	4	7	6	22500


> New Y[]: 
	
	 2  0  4  1  0  1  3  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 194 #######################


> Neighbours evaluated; 16
> Selected Move:	5045	3	5	4	22500


> New Y[]: 
	
	 2  0  4  1  1  0  3  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 195 #######################


> Neighbours evaluated; 17
> Selected Move:	4935	4	6	9	23000


> New Y[]: 
	
	 2  0  4  1  1  0  1  1  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 196 #######################


> Neighbours evaluated; 14
> Selected Move:	5020	3	7	5	22000


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 197 #######################


> Neighbours evaluated; 16
> Selected Move:	5010	4	9	5	22000


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 198 #######################


> Neighbours evaluated; 18
> Selected Move:	4975	3	3	8	21500


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 199 #######################


> Neighbours evaluated; 21
> Selected Move:	4968	4	5	9	21500


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 200 #######################


> Neighbours evaluated; 21
> Selected Move:	4752	4	9	4	22300


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 201 #######################


> Neighbours evaluated; 19
> Selected Move:	4758	3	8	3	22800


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 202 #######################


> Neighbours evaluated; 13
> Selected Move:	4744	4	4	3	22800


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 203 #######################


> Neighbours evaluated; 15
> Selected Move:	4700	2	6	-1	17300


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,28
________________________________________________________________

Best solution found: 6090
Run Termination time: 03.02.2010 20:31:37
Run duration: 00:00:36.7187500
________________________________________________________________
